首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   88737篇
  免费   4908篇
  国内免费   11809篇
化学   69652篇
晶体学   1155篇
力学   2339篇
综合类   847篇
数学   12692篇
物理学   18769篇
  2024年   44篇
  2023年   628篇
  2022年   1122篇
  2021年   1780篇
  2020年   2187篇
  2019年   2146篇
  2018年   1843篇
  2017年   2700篇
  2016年   2835篇
  2015年   2360篇
  2014年   3281篇
  2013年   6613篇
  2012年   6198篇
  2011年   4961篇
  2010年   4183篇
  2009年   5758篇
  2008年   5961篇
  2007年   6166篇
  2006年   5599篇
  2005年   4733篇
  2004年   4409篇
  2003年   3652篇
  2002年   4873篇
  2001年   2807篇
  2000年   2591篇
  1999年   2431篇
  1998年   2122篇
  1997年   1642篇
  1996年   1155篇
  1995年   1320篇
  1994年   1177篇
  1993年   977篇
  1992年   925篇
  1991年   620篇
  1990年   520篇
  1989年   493篇
  1988年   357篇
  1987年   288篇
  1986年   265篇
  1985年   209篇
  1984年   226篇
  1983年   124篇
  1982年   197篇
  1981年   160篇
  1980年   180篇
  1979年   165篇
  1978年   143篇
  1977年   88篇
  1976年   73篇
  1973年   42篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
961.
We study the large-time behavior and rate of convergence to the invariant measures of the processes dX (t)=b(X) (t)) dt + (X (t)) dB(t). A crucial constant appears naturally in our study. Heuristically, when the time is of the order exp( – )/2 , the transition density has a good lower bound and when the process has run for about exp( – )/2, it is very close to the invariant measure. LetL =(2/2) – U · be a second-order differential operator on d. Under suitable conditions,L z has the discrete spectrum
- \lambda _2^\varepsilon ...and lim \varepsilon ^2 log \lambda _2^\varepsilon = - \Lambda \hfill \\ \varepsilon \to 0 \hfill \\ \end{gathered} $$ " align="middle" vspace="20%" border="0">  相似文献   
962.
Summary In the present work we extent the results in [RS] on CHIP, i.e. Cardinal Hermite Interpolation by the span of translates of directional derivatives of a box spline. These directional derivatives are that ones which define the type of the Hermite Interpolation. We admit here several (linearly independent) directions with multiplicities instead of one direction as in [RS]. Under the same assumptions on the smoothness of the box spline and its defining matrixT we can prove as in [RS]: CHIP has a system of fundamental solutions which are inL L 2 together with its directional derivatives mentioned above. Moreover, for data sequences inl p ( d ), 1p2, there is a spline function inL p, 1/p+1/p=1, which solves CHIP.Research supported in part by NSERC Canada under Grant # A7687. This research was completed while this author was supported by a grant from the Deutscher Akademischer Austauschdienst  相似文献   
963.
In this paper, assuming a certain set-theoretic hypothesis, a positive answer is given to a question of H. Kraljevi, namely it is shown that there exists a Lebesgue measurable subsetA of the real line such that the set {c R: A + cA contains an interval} is nonmeasurable. Here the setA + cA = {a + ca: a, a A}. Two other results about sets of the formA + cA are presented.  相似文献   
964.
IfK is a field of characteristic 0 then the following is shown. Iff, g, h: M n (K) K are non-constant solutions of the Binet—Pexider functional equation
  相似文献   
965.
The purpose of this paper is to solve the following Pythagorean functional equation:(e p(x,y) ) 2 ) = q(x,y) 2 + r(x, y) 2, where each ofp(x,y), q(x, y) andr(x, y) is a real-valued unknown harmonic function of the real variablesx, y on the wholexy-planeR 2.The result is as follows.  相似文献   
966.
We solve the functional equation
  相似文献   
967.
LetC m be a compound quadrature formula, i.e.C m is obtained by dividing the interval of integration [a, b] intom subintervals of equal length, and applying the same quadrature formulaQ n to every subinterval. LetR m be the corresponding error functional. Iff (r) > 0 impliesR m [f] > 0 (orR m [f] < 0),=" then=" we=" say=">C m is positive definite (or negative definite, respectively) of orderr. This is the case for most of the well-known quadrature formulas. The assumption thatf (r) > 0 may be weakened to the requirement that all divided differences of orderr off are non-negative. Thenf is calledr-convex. Now letC m be positive definite or negative definite of orderr, and letf be continuous andr-convex. We prove the following direct and inverse theorems for the errorR m [f], where , denotes the modulus of continuity of orderr:
  相似文献   
968.
Summary Comparison theorems for weak splittings of bounded operators are presented. These theorems extend the classical comparison theorem for regular splittings of matrices by Varga, the less known result by Wonicki, and the recent results for regular and weak regular splittings of matrices by Neumann and Plemmons, Elsner, and Lanzkron, Rose and Szyld. The hypotheses of the theorems presented here are weaker and the theorems hold for general Banach spaces and rather general cones. Hypotheses are given which provide strict inequalities for the comparisons. It is also shown that the comparison theorem by Alefeld and Volkmann applies exclusively to monotone sequences of iterates and is not equivalent to the comparison of the spectral radius of the iteration operators.This work was supported by the National Science Foundation grants DMS-8807338 and INT-8918502  相似文献   
969.
Summary We prove that the error inn-point Gaussian quadrature, with respect to the standard weight functionw1, is of best possible orderO(n –2) for every bounded convex function. This result solves an open problem proposed by H. Braß and published in the problem section of the proceedings of the 2. Conference on Numerical Integration held in 1981 at the Mathematisches Forschungsinstitut Oberwolfach (Hämmerlin 1982; Problem 2). Furthermore, we investigate this problem for positive quadrature rules and for general product quadrature. In particular, for the special class of Jacobian weight functionsw , (x)=(1–x)(1+x), we show that the above result for Gaussian quadrature is not valid precisely ifw , is unbounded.Dedicated to Prof. H. Braß on the occasion of his 55th birthday  相似文献   
970.
Summary Utilizing kernel structure properties a unified construction of Hankel matrix inversion algorithms is presented. Three types of algorithms are obtained: 1)O(n 2) complexity Levinson type, 2)O (n) parallel complexity Schur-type, and 3)O(n log2 n) complexity asymptotically fast ones. All algorithms work without additional assumption (like strong nonsingularity).  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号